<HTML><HEAD><TITLE>graph_get_all_edges(+Graph, -EdgeList)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>graph_get_all_edges(+Graph, -EdgeList)</H1>
Returns a sorted list of all edges in the graph
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>EdgeList</EM></DT>
<DD>a list of e/3 edge structures
</DD>
</DL>
<H2>Description</H2>
<P>
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>graph_get_all_edges(+, -) is det
</UL>
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/graph_get_adjacent_edges-3.html">graph_get_adjacent_edges / 3</A>, <A HREF="../../lib/graph_algorithms/graph_get_incoming_edges-3.html">graph_get_incoming_edges / 3</A>, <A HREF="../../lib/graph_algorithms/graph_get_maxnode-2.html">graph_get_maxnode / 2</A>
</BODY></HTML>
